Measuring Confinement via Weak Bisimulation
نویسندگان
چکیده
It is well known that observability is closely related to vulnerability against confidentiality attacks: once a low level process is able to observe differences in the behaviour of a high level process it is able to deduce information about its secrets, and confidentiality is thus at least partially violated. However, if whatever the high level secrets are, the behaviours of the observed processes are all equivalent, then a potential attacker cannot reveal any secret information. The recent literature has shown that perfect confinement is a requirement which is hardly met by the real-world systems. With this motivation, in previous work [1, 2], we began looking at approximative notions of confinement. This research is based on the study of quantitative versions of various process equivalences by re-casting them in terms of linear operators. It turned out that process equivalences such as tree isomorphism and bisimulation can be understood in terms of Probabilistic Abstract Interpretation [3]. In particular, two processes are equivalent if there exists a common probabilistic abstraction of both for an appropriate class of abstractions which depend on the notion of observation we are interested in. Within this setting we were then able to formulate approximate notions of these process equivalences. This leads naturally to the definition of corresponding approximate notions of confinement. Each notion has a quantity ε associated to it which lends itself to a statistical interpretation in terms of the effort needed to an attacker to break a system. This gives a measure of the confinement of the system. The current work aims in extending this approach to accommodate another important notion of observability, namely probabilistic weak bisimulation. Weak bisimulation is of particular importance in the context of security as it is quite natural to assume that the actions of high level principals cannot be observed directly by the low level processes. The high level behaviour is thus modelled by τ actions, see e.g. [4, 5].
منابع مشابه
A Note on the Approximation of Weak Probabilistic Bisimulation
The need for flexible and formal approaches to the comparison of different process models is motivated in several application domains and with respect to different system properties. They can be helpful to compare a web service with some desired qualitative/quantitative service description, to relate an implemented software architecture to a reference dependable architectural model, and to reve...
متن کاملWeak Bisimulation and Open Maps
A systematic treatment of weak bisimulation and observational congruence on presheaf models is presented. The theory is developed with respect to a “hiding” functor from a category of paths to observable paths. Via a view of processes as bundles , we are able to account for weak morphisms (roughly only required to preserve observable paths) and to derive a saturation monad (on the category of p...
متن کاملProofs Methods for Bisimulation Based Information Flow Security
We study how to efficiently decide if a process is Persistent BNDC (P BNDC, for short). The P BNDC property ensures that a process is “secure” in dynamic contexts, i.e., contexts that can be reconfigured at runtime. We exploit a characterization of P BNDC as Weak Bisimulation up to a set of actions. In the case of finite-state processes, we study two methods for computing the largest weak bisim...
متن کاملTree Morphisms and Bisimulations
A category of action labelled trees is de ned that can be used to model unfolding of labelled transition systems and to study behavioural relations over them In this paper we study ve di erent equivalences based on bisimulation for our model One that we called resource bisimulation amounts essentially to three isomorphism An other its weak counterpart permits abstracting from silent actions whi...
متن کاملInformation Flow Analysis via Equational Reasoning
In this work, a process algebra is designed around an ACUID equational theory extended with prefixes symbolizing actions, and by making parallel synchronous composition distributive over non-deterministic choice; such a synchronous composition is commutative and non-associative. Bisimulation between processes is then interpretable as congruence over such an equational theory. It is shown that i...
متن کامل